Bounds on linear PDEs via semidefinite optimization
نویسندگان
چکیده
منابع مشابه
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to obtain a hierarchy of upper and lower bounds on linear functionals defined on solutions of linear partial differential equations. We apply the proposed method to examples of PDEs in one and two dimensions, with very enc...
متن کاملSolving Linear Partial Differential Equations via Semidefinite Optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this thesis a new methodology based on semidefinite optimization, to obtain a hierarchy of upper and lower bounds on both linear and nonlinear functionals defined on solutions of linear partial differential equations. We apply the proposed methods to examples of PDEs in one and two dime...
متن کاملOn solving biquadratic optimization via semidefinite relaxation
In this paper, we study a class of biquadratic optimization problems. We first relax the original problem to its semidefinite programming (SDP) problem and discuss the approximation ratio between them. Under some conditions, we show that the relaxed problem is tight. Then we consider how to approximately solve the problems in polynomial time. Under several different constraints, we present vari...
متن کاملGeneralized Chebyshev Bounds via Semidefinite Programming
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first two moments of the distribution, can be efficiently computed using convex optimization. This result generalizes Chebyshev’s inequality for scalar random variables. Two semidefinite programming formulations are presented, with a constructive proof based on convex optimization duality and elementary...
متن کاملOptimal bounds for correlations via semidefinite programming
Nonlocal boxes (NLBs) are devices that are used to generate correlated bits between two spatially separated parties. If the generated correlation is weak, it can sometimes be distilled into a stronger correlation by repeated applications of the nonlocal box. We initiate here a study of the distillation of correlations for nonlocal boxes that output quantum states rather than classical bits. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2006
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-006-0702-z